Developing Proof Rules for Distributed Real-Time Systems with PVS
نویسنده
چکیده
In previous work, the veriication system PVS has been used to support an assertional method for the speciication and veriication of distributed real-time systems. Essential part of the method is a com-positional rule for parallel composition. In this paper we focus on the formalization of parallel composition in PVS. Two, equivalent, versions of the semantics of parallel composition are formulated in the speciica-tion language of PVS. Based on this semantics, several proof rules are shown to be sound, using the interactive proof checker of PVS. We indicate how the general framework can be instantiated for a particular class of applications by giving an axiomatization of asynchronous communication .
منابع مشابه
Formal Veriication of the Binary Exponential Backoo Protocol
We present a formal framework for the speciication and veriication of distributed real-time systems. To obtain mechanical support, this framework has been deened in the language of the proof checker PVS. Intermediate stages of the design are represented by mixed terms where speciications and programming constructs can be combined. Compositional proof rules allow the veriication of design steps....
متن کاملMechanical Veriication of Timed Automata: a Case Study
This paper reports the results of a case study on the feasibility of developing and applying mechanical methods, based on the proof system PVS, to prove propositions about real-time systems speci ed in the LynchVaandrager timed automata model. In using automated provers to prove propositions about systems described by a speci c mathematical model, both the proofs and the proof process can be si...
متن کاملCompositional Verification of Real-Time Applications
To support top-down design of distributed real-time systems, a framework of mixed terms has been incorporated in the veriication system PVS. Programs and assertional speciications are treated in a uniform way. We focus on the timed behaviour of parallel composition and hiding, presenting several alternatives for the deenition of a deno-tational semantics. This forms the basis of compositional p...
متن کاملVerification of Hybrid Systems: Formalization and Proof Rules in PVS
Combining discrete state-machines with continuous behavior, hybrid systems are a well-established mathematical model for discrete systems acting in a continuous environment. As a priori infinite state systems, their computational properties are undecidable in the general model and the main line of research concentrates on model checking of finite abstractions of restricted subclasses of the gen...
متن کاملPVS : Combining Speci cation , Proof Checking , and Model Checking ? To appear in CAV ' 96
PVS (Prototype Veriication System) is an environment for constructing clear and precise speciications and for developing readable proofs that have been mechanically veriied. It is designed to exploit the synergies between language and deduction, automation and interaction, and theorem proving and model checking. For example, the type system of PVS requires the use of theorem proving to establis...
متن کامل